Approximating Orthogonal Matrices by Permutation Matrices
نویسندگان
چکیده
منابع مشابه
Approximating Orthogonal Matrices by Permutation Matrices
Motivated in part by a problem of combinatorial optimization and in part by analogies with quantum computations, we consider approximations of orthogonal matrices U by “non-commutative convex combinations”A of permutation matrices of the type A = P Aσσ, where σ are permutation matrices and Aσ are positive semidefinite n × n matrices summing up to the identity matrix. We prove that for every n× ...
متن کاملA method for approximating pairwise comparison matrices by consistent matrices
In several methods of multiattribute decision making, pairwise comparison matrices are applied to derive implicit weights for a given set of decision alternatives. A class of the approaches is based on the approximation of the pairwise comparison matrix by a consistent matrix. In the paper this approximation problem is considered in the least-squares sense. In general, the problem is nonconvex ...
متن کاملDisentangling orthogonal matrices.
Motivated by a certain molecular reconstruction methodology in cryo-electron microscopy, we consider the problem of solving a linear system with two unknown orthogonal matrices, which is a generalization of the well-known orthogonal Procrustes problem. We propose an algorithm based on a semi-definite programming (SDP) relaxation, and give a theoretical guarantee for its performance. Both theore...
متن کاملDisentangling Two Orthogonal Matrices
Motivated by a certain molecular reconstruction methodology in cryo-electron microscopy, we consider the problem of solving a linear system with two unknown orthogonal matrices, which is a generalization of the well-known orthogonal Procrustes problem. We propose an algorithm based on a semi-definite programming (SDP) relaxation, and give a theoretical guarantee for its performance. Both theore...
متن کاملSpectral statistics of permutation matrices.
We compute the mean two-point spectral form factor and the spectral number variance for permutation matrices of large order. The two-point correlation function is expressed in terms of generalized divisor functions, which are frequently discussed in number theory. Using classical results from number theory and casting them in a convenient form, we derive expressions which include the leading an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pure and Applied Mathematics Quarterly
سال: 2006
ISSN: 1558-8599,1558-8602
DOI: 10.4310/pamq.2006.v2.n4.a3